Cartesian closed 2-categories and permutation equivalence in higher-order rewriting
نویسنده
چکیده
We propose a semantics for permutation equivalence in higher-order rewriting. This semantics takes place in cartesian closed 2-categories, and is proved sound and complete.
منابع مشابه
The HasCasl Prologue: Categorical Syntax and Semantics of the Partial λ-Calculus
We develop the semantic foundations of the specification language HasCasl, which combines algebraic specification and functional programming on the basis of Moggi’s partial λ-calculus. Generalizing Lambek’s classical equivalence between the simply typed λ-calculus and cartesian closed categories, we establish an equivalence between partial cartesian closed categories (pccc’s) and partial λ-theo...
متن کاملA NOTE ON REWRITING THEORY FOR UNIQUENESS OF ITERATION Dedicated to our friend and colleague
Uniqueness for higher type term constructors in lambda calculi (e.g. surjective pairing for product types, or uniqueness of iterators on the natural numbers) is easily expressed using universally quanti ed conditional equations. We use a technique of Lambek[18] involving Mal'cev operators to equationally express uniqueness of iteration (more generally, higher-order primitive recursion) in a sim...
متن کاملThe Logic of the Partial λ-Calculus With Equality
We investigate the logical aspects of the partial λ-calculus with equality, exploiting an equivalence between partial λ-theories and partial cartesian closed categories (pcccs) established here. The partial λ-calculus with equality provides a full-blown intuitionistic higher order logic, which in a precise sense turns out to be almost the logic of toposes, the distinctive feature of the latter ...
متن کاملA NOTE ON REWRITING THEORY FOR UNIQUENESS OFITERATIONDedicated to our friend and colleague Jim
Uniqueness for higher type term constructors in lambda calculi (e.g. surjective pairing for product types, or uniqueness of iterators on the natural numbers) is easily expressed using universally quantiied conditional equations. We use a technique of Lambekk18] involving Mal'cev operators to equationally express uniqueness of iteration (more generally, higher-order primitive recursion) in a sim...
متن کاملEquilogical spaces
It is well known that one can build models of full higher-order dependent type theory (also called the calculus of constructions) using partial equivalence relations (PERs) and assemblies over a partial combinatory algebra (PCA). But the idea of categories of PERs and ERs (total equivalence relations) can be applied to other structures as well. In particular, we can easily define the category o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Logical Methods in Computer Science
دوره 9 شماره
صفحات -
تاریخ انتشار 2013